全文获取类型
收费全文 | 268篇 |
免费 | 189篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 3篇 |
2021年 | 12篇 |
2020年 | 14篇 |
2019年 | 8篇 |
2018年 | 12篇 |
2017年 | 24篇 |
2016年 | 27篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 26篇 |
2012年 | 30篇 |
2011年 | 31篇 |
2010年 | 12篇 |
2009年 | 23篇 |
2008年 | 21篇 |
2007年 | 21篇 |
2006年 | 31篇 |
2005年 | 28篇 |
2004年 | 16篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 13篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有469条查询结果,搜索用时 578 毫秒
401.
许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间,因此可以产生大量的动态松弛时间.针对时限等于周期的偶发任务集,提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL.该算法基于最优在线调度算法LRE-TL,利用TL面内节能实时调度思想,在每个TL面的提前完成时刻实现动态松弛时间回收,降... 相似文献
402.
通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性. 相似文献
403.
404.
EOS(对地观测卫星)成像调度需要根据用户提出的成像任务需求确定卫星成像序列,是一个复杂的组合优化问题。考虑到成像侧视约束条件,建立EOS成像调度的多目标有向无环约束图模型。在此模型的基础上提出了基于SPEA2(strength pareto evolutionary algorithm 2)的多目标成像调度算法,采用约束控制技术设计遗传算子处理成像约束。经过三个实际的多目标成像调度问题测试,表明该算法可以有效地解决EOS成像调度问题。 相似文献
405.
For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S1 and S2 such that the sum of elements in S1 is equal to the sum of elements in S2. If additionally two elements (the kernels) r1, r2 ∈ S are given which must not be assigned to the same set Si, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000 相似文献
406.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001 相似文献
407.
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999 相似文献
408.
作为全球唯一的超级大国,美国在空间观测方面具有勿庸置疑的优势。介绍了美国现有成像侦察卫星的构成、作用和发展现状,指出了美军开始注重利用商业遥感图像的新趋势,并且详细介绍了当前美国成像卫星软件的商业开发以及美国未来天基雷达计划的发展。 相似文献
409.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
410.
We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are ordered. For the m machine common due date problem, we assume that one machine is maximal and impose a restriction on its load. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 525–532, 1998 相似文献